#include <bits/stdc++.h>
using namespace std;
int n,a[100005],cnt;
struct{
    int x, flag,sta;
}m[100005];
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin >> n;
    for (int i = 1; i <= n;i++)
    {
        cin >> a[i];
    }
    sort(a,a + n + 1);
    for (int i = 1; i <= n;i++)
    {
        m[i].x = a[i];
        m[i].sta = 1;
        m[i].flag = 1;
    }

    for (int i = 1; i <= n;i++)
    {
        for (int j = i + 1; j <= n; j++)
        {
            if (m[i].x < m[j].x && m[j].flag == 1)
            {
                m[i].sta = 0;
                m[j].flag = 0;
                break;
            }
        }
    }
    for (int i = 1; i<= n; i++)
    {
        if (m[i].sta == 1)
        {
            cnt += 1;
        }
    }
    cout << cnt;
    return 0;
}
